全文获取类型
收费全文 | 15521篇 |
免费 | 1371篇 |
国内免费 | 1231篇 |
专业分类
电工技术 | 314篇 |
技术理论 | 1篇 |
综合类 | 1080篇 |
化学工业 | 167篇 |
金属工艺 | 133篇 |
机械仪表 | 870篇 |
建筑科学 | 679篇 |
矿业工程 | 206篇 |
能源动力 | 90篇 |
轻工业 | 121篇 |
水利工程 | 121篇 |
石油天然气 | 90篇 |
武器工业 | 102篇 |
无线电 | 1889篇 |
一般工业技术 | 546篇 |
冶金工业 | 540篇 |
原子能技术 | 46篇 |
自动化技术 | 11128篇 |
出版年
2024年 | 12篇 |
2023年 | 115篇 |
2022年 | 209篇 |
2021年 | 270篇 |
2020年 | 277篇 |
2019年 | 240篇 |
2018年 | 257篇 |
2017年 | 333篇 |
2016年 | 410篇 |
2015年 | 411篇 |
2014年 | 907篇 |
2013年 | 767篇 |
2012年 | 959篇 |
2011年 | 1397篇 |
2010年 | 1010篇 |
2009年 | 950篇 |
2008年 | 1204篇 |
2007年 | 1228篇 |
2006年 | 1225篇 |
2005年 | 1043篇 |
2004年 | 890篇 |
2003年 | 861篇 |
2002年 | 685篇 |
2001年 | 537篇 |
2000年 | 387篇 |
1999年 | 335篇 |
1998年 | 243篇 |
1997年 | 177篇 |
1996年 | 139篇 |
1995年 | 133篇 |
1994年 | 79篇 |
1993年 | 60篇 |
1992年 | 44篇 |
1991年 | 48篇 |
1990年 | 24篇 |
1989年 | 30篇 |
1988年 | 17篇 |
1987年 | 17篇 |
1986年 | 23篇 |
1985年 | 35篇 |
1984年 | 20篇 |
1983年 | 19篇 |
1982年 | 12篇 |
1981年 | 19篇 |
1980年 | 12篇 |
1979年 | 14篇 |
1977年 | 5篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1972年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Retrieving 3D shapes with 2D images has become a popular research area nowadays, and a great deal of work has been devoted to reducing the discrepancy between 3D shapes and 2D images to improve retrieval performance. However, most approaches ignore the semantic information and decision boundaries of the two domains, and cannot achieve both domain alignment and category alignment in one module. In this paper, a novel Collaborative Distribution Alignment (CDA) model is developed to address the above existing challenges. Specifically, we first adopt a dual-stream CNN, following a similarity guided constraint module, to generate discriminative embeddings for input 2D images and 3D shapes (described as multiple views). Subsequently, we explicitly introduce a joint domain-class alignment module to dynamically learn a class-discriminative and domain-agnostic feature space, which can narrow the distance between 2D image and 3D shape instances of the same underlying category, while pushing apart the instances from different categories. Furthermore, we apply a decision boundary refinement module to avoid generating class-ambiguity embeddings by dynamically adjusting inconsistencies between two discriminators. Extensive experiments and evaluations on two challenging benchmarks, MI3DOR and MI3DOR-2, demonstrate the superiority of the proposed CDA method for 2D image-based 3D shape retrieval task. 相似文献
2.
3.
In this paper, the feature representation of an image by CNN is used to hide the secret image into the cover image. The style of the cover image hides the content of the secret image and produce a stego image using Neural Style Transfer (NST) algorithm, which resembles the cover image and also contains the semantic content of secret image. The main technical contributions are to hide the content of the secret image in the in-between hidden layered style features of the cover image, which is the first of its kind in the present state-of-art-technique. Also, to recover the secret image from the stego image, destylization is done with the help of conditional generative adversarial networks (GANs) using Residual in Residual Dense Blocks (RRDBs). Further, stego images from different layer combinations of content and style features are obtained and evaluated. Evaluation is based on the visual similarity and quality loss between the cover-stego pair and the secret-reconstructed secret pair of images. From the experiments, it has been observed that the proposed algorithm has 43.95 dB Peak Signal-to-Noise Ratio (PSNR)), .995 Structural Similarity Index (SSIM), and .993 Visual Information Fidelity (VIF) for the ImageNet dataset. The proposed algorithm is found to be more robust against StegExpose than the traditional methods. 相似文献
4.
Farzaneh Khorasani Morteza Mohammadi Zanjireh Mahdi Bahaghighat Qin Xin 《计算机系统科学与工程》2022,40(3):1085-1098
With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed. 相似文献
5.
针对传统大数据特征加密方法中大数据精度较差、加密耗时较长的问题,提出基于信息熵抑制的大数据特征隐匿性加密方法。分析信息熵抑制相关理论,采用信息熵映射函数对大数据分类,将信息熵抑制过程转化为计算2个文件相似性的过程,并根据余弦相似度公式以及Hamming距离值计算数据相似度,完成数据消冗。在完成数据消冗的基础上,分析分组密码方法和ECC加密方法,结合两种方法得到大数据特征隐匿性加密处理计算公式,实现基于信息熵抑制的大数据特征隐匿性加密。实验研究结果表明,所提方法能够有效去除冗余数据,提升大数据精度,加快数据加密的处理速度,高效完成大数据加密过程。 相似文献
6.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
7.
8.
Social media has been widely used for emergency communication both in disaster-affected areas and unaffected areas. Comparing emotional reaction and information propagation between on-site users and off-site users from a spatiotemporal perspective can help better comprehend collective human behavior during natural disasters. In this study, we investigate sentiment and retweet patterns of disaster-affected areas and disaster-unaffected areas at different stages of Hurricane Harvey. The results show that off-site tweets were more negative than on-site tweets, especially during the disaster. As for retweet patterns, indifferent-neutral and positive tweets spread broader than mixed-neutral and negative tweets. However, negative tweets spread faster than positive tweets, which reveals that social media users were more sensitive to negative information in disaster situations. With the development of the disaster, social media users were more sensitive to on-site positive messages than off-site negative posts. This data-driven study reveals the significant effect of sentiment expression on the publication and re-distribution of disaster-related messages. It generates implications for emergency communication and disaster management. 相似文献
9.
10.
为了更加有效地检索到符合用户复杂语义需求的图像,提出一种基于文本描述与语义相关性分析的图像检索算法。该方法将图像检索分为两步:基于文本语义相关性分析的图像检索和基于SIFT特征的相似图像扩展检索。根据自然语言处理技术分析得到用户文本需求中的关键词及其语义关联,在选定图像库中通过语义相关性分析得到“种子”图像;接下来在图像扩展检索中,采用基于SIFT特征的相似图像检索,利用之前得到的“种子”图像作为查询条件,在网络图像库中进行扩展检索,并在结果集上根据两次检索的图像相似度进行排序输出,最终得到更加丰富有效的图像检索结果。为了证明算法的有效性,在标准数据集Corel5K和网络数据集Deriantart8K上完成了多组实验,实验结果证明该方法能够得到较为精确地符合用户语义要求的图像检索结果,并且通过扩展算法可以得到更加丰富的检索结果。 相似文献